The L1-Potts Functional for Robust Jump-Sparse Reconstruction

نویسندگان

  • Andreas Weinmann
  • Martin Storath
  • Laurent Demaret
چکیده

We investigate the nonsmooth and nonconvex L1-Potts functional in discrete and continuous time. We show Γ-convergence of discrete L1-Potts functionals toward their continuous counterpart and obtain a convergence statement for the corresponding minimizers as the discretization gets finer. For the discrete L1-Potts problem, we introduce an O(n2) time and O(n) space algorithm to compute an exact minimizer. We apply L1-Potts minimization to the problem of recovering piecewise constant signals from noisy measurements f. It turns out that the L1-Potts functional has a quite interesting blind deconvolution property. In fact, we show that mildly blurred jump-sparse signals are reconstructed by minimizing the L1-Potts functional. Furthermore, for strongly blurred signals and a known blurring operator, we derive an iterative reconstruction algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The L-potts Functional for Robust Jump-sparse Reconstruction

We investigate the non-smooth and non-convex L1-Potts functional in discrete and continuous time. We show Γ-convergence of discrete L1-Potts functionals towards their continuous counterpart and obtain a convergence statement for the corresponding minimizers as the discretization gets ner. For the discrete L1-Potts problem, we introduce an O(n2) time and O(n) space algorithm to compute an exact ...

متن کامل

Robust Image Analysis by L1-Norm Semi-supervised Learning

This paper presents a novel L1-norm semisupervised learning algorithm for robust image analysis by giving new L1-norm formulation of Laplacian regularization which is the key step of graph-based semi-supervised learning. Since our L1-norm Laplacian regularization is defined directly over the eigenvectors of the normalized Laplacian matrix, we successfully formulate semi-supervised learning as a...

متن کامل

Sparse and Robust Signal Reconstruction

Many problems in signal processing and statistical inference are based on finding a sparse solution to an undetermined linear system. The reference approach to this problem of finding sparse signal representations, on overcomplete dictionaries, leads to convex unconstrained optimization problems, with a quadratic term l2, for the adjustment to the observed signal, and a coefficient vector l1-no...

متن کامل

Bayesian Structure Learning for Markov Random Fields with a Spike and Slab Prior

In recent years a number of methods have been developed for automatically learning the (sparse) connectivity structure of Markov Random Fields. These methods are mostly based on L1-regularized optimization which has a number of disadvantages such as the inability to assess model uncertainty and expensive crossvalidation to find the optimal regularization parameter. Moreover, the model’s predict...

متن کامل

Approximation and Optimization in Image Restoration and Reconstruction

Traditional wavelets have a number of vanishing moments that corresponds to their equivalent order of the derivation. They offer good energy compaction for piecewise smooth signals, but are less appropriate for more complex signals such as those originating in functional imaging ; e.g., the hemodynamic response after brain activation in functional magnetic resonance imaging (fMRI) and time acti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Numerical Analysis

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2015